

<!DOCTYPE html>
<html lang="zh-CN" data-default-color-scheme=auto>



<head>
  <meta charset="UTF-8">
  <link rel="apple-touch-icon" sizes="76x76" href="/img/fluid.png">
  <link rel="icon" href="/img/fluid.png">
  <meta name="viewport" content="width=device-width, initial-scale=1.0, maximum-scale=5.0, shrink-to-fit=no">
  <meta http-equiv="x-ua-compatible" content="ie=edge">
  
  <meta name="theme-color" content="#2f4154">
  <meta name="author" content="ShanCe">
  <meta name="keywords" content="">
  
    <meta name="description" content="构建树123456789101112131415161718192021222324252627282930313233class Node:    def __init__(self, value) -&gt; None:        self.value &#x3D; value        self.lchild &#x3D; None # 左孩子        self.rchild &#x3D; None #">
<meta property="og:type" content="article">
<meta property="og:title" content="2.二叉树的遍历">
<meta property="og:url" content="https://sweetshance.github.io/2023/12/21/%E7%AE%97%E6%B3%95/%E4%BA%8C%E5%8F%89%E6%A0%91/2-%E4%BA%8C%E5%8F%89%E6%A0%91%E7%9A%84%E9%81%8D%E5%8E%86/index.html">
<meta property="og:site_name" content="ShanCe的博客">
<meta property="og:description" content="构建树123456789101112131415161718192021222324252627282930313233class Node:    def __init__(self, value) -&gt; None:        self.value &#x3D; value        self.lchild &#x3D; None # 左孩子        self.rchild &#x3D; None #">
<meta property="og:locale" content="zh_CN">
<meta property="og:image" content="https://sweetshance.github.io/images/%E4%BA%8C%E5%8F%89%E6%A0%91/%E4%BA%8C%E5%8F%89%E6%A0%911-2.webp">
<meta property="og:image" content="https://sweetshance.github.io/images/%E4%BA%8C%E5%8F%89%E6%A0%91/%E4%BA%8C%E5%8F%89%E6%A0%912-2.png">
<meta property="article:published_time" content="2023-12-21T09:44:37.000Z">
<meta property="article:modified_time" content="2023-12-26T08:11:33.915Z">
<meta property="article:author" content="ShanCe">
<meta property="article:tag" content="二叉树、二叉树遍历">
<meta name="twitter:card" content="summary_large_image">
<meta name="twitter:image" content="https://sweetshance.github.io/images/%E4%BA%8C%E5%8F%89%E6%A0%91/%E4%BA%8C%E5%8F%89%E6%A0%911-2.webp">
  
  
    <meta name="referrer" content="no-referrer-when-downgrade">
  
  
  <title>2.二叉树的遍历 - ShanCe的博客</title>

  <link  rel="stylesheet" href="https://lib.baomitu.com/twitter-bootstrap/4.6.1/css/bootstrap.min.css" />



  <link  rel="stylesheet" href="https://lib.baomitu.com/github-markdown-css/4.0.0/github-markdown.min.css" />

  <link  rel="stylesheet" href="https://lib.baomitu.com/hint.css/2.7.0/hint.min.css" />

  <link  rel="stylesheet" href="https://lib.baomitu.com/fancybox/3.5.7/jquery.fancybox.min.css" />



<!-- 主题依赖的图标库，不要自行修改 -->
<!-- Do not modify the link that theme dependent icons -->

<link rel="stylesheet" href="//at.alicdn.com/t/font_1749284_hj8rtnfg7um.css">



<link rel="stylesheet" href="//at.alicdn.com/t/font_1736178_lbnruvf0jn.css">


<link  rel="stylesheet" href="/css/main.css" />


  <link id="highlight-css" rel="stylesheet" href="/css/highlight.css" />
  
    <link id="highlight-css-dark" rel="stylesheet" href="/css/highlight-dark.css" />
  




  <script id="fluid-configs">
    var Fluid = window.Fluid || {};
    Fluid.ctx = Object.assign({}, Fluid.ctx)
    var CONFIG = {"hostname":"sweetshance.github.io","root":"/","version":"1.9.4","typing":{"enable":true,"typeSpeed":70,"cursorChar":"_","loop":false,"scope":[]},"anchorjs":{"enable":true,"element":"h1,h2,h3,h4,h5,h6","placement":"left","visible":"hover","icon":""},"progressbar":{"enable":true,"height_px":3,"color":"#29d","options":{"showSpinner":false,"trickleSpeed":100}},"code_language":{"enable":true,"default":"TEXT"},"copy_btn":true,"image_caption":{"enable":true},"image_zoom":{"enable":true,"img_url_replace":["",""]},"toc":{"enable":true,"placement":"right","headingSelector":"h1,h2,h3,h4,h5,h6","collapseDepth":0},"lazyload":{"enable":true,"loading_img":"/img/loading.gif","onlypost":false,"offset_factor":2},"web_analytics":{"enable":false,"follow_dnt":true,"baidu":null,"google":null,"gtag":null,"tencent":{"sid":null,"cid":null},"woyaola":null,"cnzz":null,"leancloud":{"app_id":null,"app_key":null,"server_url":null,"path":"window.location.pathname","ignore_local":false}},"search_path":"/local-search.xml"};

    if (CONFIG.web_analytics.follow_dnt) {
      var dntVal = navigator.doNotTrack || window.doNotTrack || navigator.msDoNotTrack;
      Fluid.ctx.dnt = dntVal && (dntVal.startsWith('1') || dntVal.startsWith('yes') || dntVal.startsWith('on'));
    }
  </script>
  <script  src="/js/utils.js" ></script>
  <script  src="/js/color-schema.js" ></script>
  


  
<meta name="generator" content="Hexo 5.4.2"></head>


<body>
  

  <header>
    

<div class="header-inner" style="height: 70vh;">
  <nav id="navbar" class="navbar fixed-top  navbar-expand-lg navbar-dark scrolling-navbar">
  <div class="container">
    <a class="navbar-brand" href="/">
      <strong>ShanCe</strong>
    </a>

    <button id="navbar-toggler-btn" class="navbar-toggler" type="button" data-toggle="collapse"
            data-target="#navbarSupportedContent"
            aria-controls="navbarSupportedContent" aria-expanded="false" aria-label="Toggle navigation">
      <div class="animated-icon"><span></span><span></span><span></span></div>
    </button>

    <!-- Collapsible content -->
    <div class="collapse navbar-collapse" id="navbarSupportedContent">
      <ul class="navbar-nav ml-auto text-center">
        
          
          
          
          
            <li class="nav-item">
              <a class="nav-link" href="/">
                <i class="iconfont icon-home-fill"></i>
                <span>首页</span>
              </a>
            </li>
          
        
          
          
          
          
            <li class="nav-item">
              <a class="nav-link" href="/archives/">
                <i class="iconfont icon-archive-fill"></i>
                <span>归档</span>
              </a>
            </li>
          
        
          
          
          
          
            <li class="nav-item">
              <a class="nav-link" href="/categories/">
                <i class="iconfont icon-category-fill"></i>
                <span>分类</span>
              </a>
            </li>
          
        
          
          
          
          
            <li class="nav-item">
              <a class="nav-link" href="/tags/">
                <i class="iconfont icon-tags-fill"></i>
                <span>标签</span>
              </a>
            </li>
          
        
          
          
          
          
            <li class="nav-item">
              <a class="nav-link" href="/about/">
                <i class="iconfont icon-user-fill"></i>
                <span>关于</span>
              </a>
            </li>
          
        
        
          <li class="nav-item" id="search-btn">
            <a class="nav-link" target="_self" href="javascript:;" data-toggle="modal" data-target="#modalSearch" aria-label="Search">
              <i class="iconfont icon-search"></i>
            </a>
          </li>
          
        
        
          <li class="nav-item" id="color-toggle-btn">
            <a class="nav-link" target="_self" href="javascript:;" aria-label="Color Toggle">
              <i class="iconfont icon-dark" id="color-toggle-icon"></i>
            </a>
          </li>
        
      </ul>
    </div>
  </div>
</nav>

  

<div id="banner" class="banner" parallax=true
     style="background: url('/img/default.png') no-repeat center center; background-size: cover;">
  <div class="full-bg-img">
    <div class="mask flex-center" style="background-color: rgba(0, 0, 0, 0.3)">
      <div class="banner-text text-center fade-in-up">
        <div class="h2">
          
            <span id="subtitle" data-typed-text="2.二叉树的遍历"></span>
          
        </div>

        
          
  <div class="mt-3">
    
      <span class="post-meta mr-2">
        <i class="iconfont icon-author" aria-hidden="true"></i>
        ShanCe
      </span>
    
    
      <span class="post-meta">
        <i class="iconfont icon-date-fill" aria-hidden="true"></i>
        <time datetime="2023-12-21 17:44" pubdate>
          2023年12月21日 下午
        </time>
      </span>
    
  </div>

  <div class="mt-1">
    
      <span class="post-meta mr-2">
        <i class="iconfont icon-chart"></i>
        
          6.4k 字
        
      </span>
    

    
      <span class="post-meta mr-2">
        <i class="iconfont icon-clock-fill"></i>
        
        
        
          54 分钟
        
      </span>
    

    
    
      
        <span id="busuanzi_container_page_pv" style="display: none">
          <i class="iconfont icon-eye" aria-hidden="true"></i>
          <span id="busuanzi_value_page_pv"></span> 次
        </span>
        
      
    
  </div>


        
      </div>

      
    </div>
  </div>
</div>

</div>

  </header>

  <main>
    
      

<div class="container-fluid nopadding-x">
  <div class="row nomargin-x">
    <div class="side-col d-none d-lg-block col-lg-2">
      

    </div>

    <div class="col-lg-8 nopadding-x-md">
      <div class="container nopadding-x-md" id="board-ctn">
        <div id="board">
          <article class="post-content mx-auto">
            <!-- SEO header -->
            <h1 style="display: none">2.二叉树的遍历</h1>
            
            
              <div class="markdown-body">
                
                <p><img src="/images/%E4%BA%8C%E5%8F%89%E6%A0%91/%E4%BA%8C%E5%8F%89%E6%A0%911-2.webp" srcset="/img/loading.gif" lazyload alt="二叉树"></p>
<h2 id="构建树"><a href="#构建树" class="headerlink" title="构建树"></a>构建树</h2><figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br></pre></td><td class="code"><pre><code class="hljs python"><span class="hljs-keyword">class</span> <span class="hljs-title class_">Node</span>:<br>    <span class="hljs-keyword">def</span> <span class="hljs-title function_">__init__</span>(<span class="hljs-params">self, value</span>) -&gt; <span class="hljs-literal">None</span>:<br>        self.value = value<br>        self.lchild = <span class="hljs-literal">None</span> <span class="hljs-comment"># 左孩子</span><br>        self.rchild = <span class="hljs-literal">None</span> <span class="hljs-comment"># 右孩子</span><br><br><span class="hljs-keyword">class</span> <span class="hljs-title class_">Tree</span>:<br>    <span class="hljs-keyword">def</span> <span class="hljs-title function_">__init__</span>(<span class="hljs-params">self</span>) -&gt; <span class="hljs-literal">None</span>:<br>        self.root = <span class="hljs-literal">None</span> <span class="hljs-comment"># 根节点</span><br><br>    <span class="hljs-keyword">def</span> <span class="hljs-title function_">add</span>(<span class="hljs-params">self, value</span>):<br>        <span class="hljs-comment"># 创建节点</span><br>        node = Node(value=value)<br>        <span class="hljs-comment"># 没有根节点这个就是根节点</span><br>        <span class="hljs-keyword">if</span> <span class="hljs-keyword">not</span> self.root:<br>            self.root = node<br>            <span class="hljs-keyword">return</span><br>        <span class="hljs-comment"># 采用中序遍历方式借助队列来寻找，二叉树最先缺少的一个节点将其补进去</span><br>        queue = [self.root]<br>        <span class="hljs-keyword">while</span> queue:<br>            index = queue.pop(<span class="hljs-number">0</span>)<br>            <span class="hljs-keyword">if</span> index.lchild:<br>                queue.append(index.lchild)<br>            <span class="hljs-keyword">else</span>:<br>                index.lchild = node<br>                <span class="hljs-keyword">return</span><br>            <br>            <span class="hljs-keyword">if</span> index.rchild:<br>                queue.append(index.rchild)<br>            <span class="hljs-keyword">else</span>:<br>                index.rchild = node<br>                <span class="hljs-keyword">return</span><br><br></code></pre></td></tr></table></figure>

<h2 id="1-先序遍历"><a href="#1-先序遍历" class="headerlink" title="1.先序遍历"></a>1.先序遍历</h2><p>任何子树的处理顺序都是：先头节点、再左子树、然后右子树<br>[1,2,3,4,5,6,7]</p>
<h3 id="1-1-递归实现"><a href="#1-1-递归实现" class="headerlink" title="1.1 递归实现"></a>1.1 递归实现</h3><p>递归的思路就是找到逻辑和出口，剩下的交给程序，从先序遍历我们可以知道，先打印头，再一直左子树到底，再右子树，所以先打印，再递归调用，左子树，再递归调用右子树，出口就是当前节点为空。</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br></pre></td><td class="code"><pre><code class="hljs python"><span class="hljs-keyword">def</span> <span class="hljs-title function_">pre_node</span>(<span class="hljs-params">node</span>):<br>    <span class="hljs-keyword">if</span> <span class="hljs-keyword">not</span> node:<br>        <span class="hljs-keyword">return</span> <span class="hljs-string">&quot;&quot;</span><br>    <span class="hljs-built_in">print</span>(node.value, end=<span class="hljs-string">&quot; &quot;</span>)<br>    pre_node(node=node.lchild)<br>    pre_node(node=node.rchild)<br><br></code></pre></td></tr></table></figure>

<h3 id="1-2-非递归实现-栈"><a href="#1-2-非递归实现-栈" class="headerlink" title="1.2 非递归实现(栈)"></a>1.2 非递归实现(栈)</h3><p>非递归实现，通过压栈的方式来实现，每次把头节点弹出来，因为栈是先进后出，所以要先把右节点压栈。</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br></pre></td><td class="code"><pre><code class="hljs python"><span class="hljs-keyword">def</span> <span class="hljs-title function_">pre_node2</span>(<span class="hljs-params">node</span>):<br>    queue = [node]<br>    <span class="hljs-keyword">while</span> queue:<br>        index_node = queue.pop()<br>        <span class="hljs-built_in">print</span>(index_node.value, end=<span class="hljs-string">&quot; &quot;</span>)<br>        <span class="hljs-keyword">if</span> index_node.rchild:<br>            queue.append(index_node.rchild)<br>        <br>        <span class="hljs-keyword">if</span> index_node.lchild:<br>            queue.append(index_node.lchild)<br></code></pre></td></tr></table></figure>

<h2 id="2-中序遍历"><a href="#2-中序遍历" class="headerlink" title="2.中序遍历"></a>2.中序遍历</h2><p>任何子树的处理顺序都是：先左子树、再头节点、然后右子树<br>[4,2,5,1,6,3,7]</p>
<h3 id="2-1-递归实现"><a href="#2-1-递归实现" class="headerlink" title="2.1 递归实现"></a>2.1 递归实现</h3><figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br></pre></td><td class="code"><pre><code class="hljs python"><span class="hljs-keyword">def</span> <span class="hljs-title function_">in_node</span>(<span class="hljs-params">node</span>):<br>    <span class="hljs-keyword">if</span> <span class="hljs-keyword">not</span> node:<br>        <span class="hljs-keyword">return</span> <span class="hljs-string">&quot;&quot;</span><br>    in_node(node=node.lchild)<br>    <span class="hljs-built_in">print</span>(node.value, end=<span class="hljs-string">&quot; &quot;</span>)<br>    in_node(node=node.rchild)<br></code></pre></td></tr></table></figure>

<h3 id="2-2-非递归实现"><a href="#2-2-非递归实现" class="headerlink" title="2.2 非递归实现"></a>2.2 非递归实现</h3><ol>
<li>当前节点index_node, 左子树进栈，一直到空（叶子节点）</li>
<li>弹出最后一个，打印，index_node 的右孩子作为当前节点</li>
<li>index_node 的右孩子入栈，直到空</li>
</ol>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br></pre></td><td class="code"><pre><code class="hljs python"><span class="hljs-keyword">def</span> <span class="hljs-title function_">in_node2</span>(<span class="hljs-params">node</span>):<br>    queue = []<br>    index_node = node<br>    <span class="hljs-keyword">while</span>(queue <span class="hljs-keyword">or</span> index_node):<br>        <span class="hljs-keyword">if</span> index_node:<br>            queue.append(index_node)<br>            index_node = index_node.lchild<br>        <span class="hljs-keyword">else</span>:<br>            index_node = queue.pop()<br>            <span class="hljs-built_in">print</span>(index_node.value, end=<span class="hljs-string">&quot; &quot;</span>)<br>            index_node = index_node.rchild<br><br></code></pre></td></tr></table></figure>

<h2 id="3-后续遍历"><a href="#3-后续遍历" class="headerlink" title="3.后续遍历"></a>3.后续遍历</h2><p>任何子树的处理顺序都是：先左子树、再右子树、然后头节点<br>[4,5,2,6,7,3,1]</p>
<h3 id="3-1-递归调用"><a href="#3-1-递归调用" class="headerlink" title="3.1 递归调用"></a>3.1 递归调用</h3><figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br></pre></td><td class="code"><pre><code class="hljs python"><span class="hljs-keyword">def</span> <span class="hljs-title function_">end_node</span>(<span class="hljs-params">node</span>):<br>    <span class="hljs-keyword">if</span> <span class="hljs-keyword">not</span> node:<br>        <span class="hljs-keyword">return</span> <span class="hljs-string">&quot;&quot;</span><br>    end_node(node=node.lchild)<br>    end_node(node=node.rchild)<br>    <span class="hljs-built_in">print</span>(node.value, end=<span class="hljs-string">&quot; &quot;</span>)<br></code></pre></td></tr></table></figure>

<h3 id="3-2-非递归调用（两个栈）"><a href="#3-2-非递归调用（两个栈）" class="headerlink" title="3.2 非递归调用（两个栈）"></a>3.2 非递归调用（两个栈）</h3><p>在先序遍历中我们先入头，再入右，再入左， 弹出得到 头左右的顺序。<br>如果我们先入头，再入左，再入右，弹出会得到 <strong>头右左</strong>。 如果我们把<strong>头弹出来的时候不打印，保存起来，放到一个新的栈里，然后从栈里打印就会得到一个逆序左右头</strong> 就是后续遍历的顺序。</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br></pre></td><td class="code"><pre><code class="hljs python"><span class="hljs-keyword">def</span> <span class="hljs-title function_">end_node2</span>(<span class="hljs-params">node</span>):<br>    queue = [node]<br>    queue2 = []<br>    <span class="hljs-keyword">while</span> queue:<br>        index_node = queue.pop()<br>        queue2.append(index_node)<br>        <span class="hljs-keyword">if</span> index_node.lchild:<br>            queue.append(index_node.lchild)<br>        <span class="hljs-keyword">if</span> index_node.rchild:<br>            queue.append(index_node.rchild)<br>    <br>    <span class="hljs-keyword">while</span> queue2:<br>        index_node = queue2.pop()<br>        <span class="hljs-built_in">print</span>(index_node.value, end=<span class="hljs-string">&quot; &quot;</span>)<br></code></pre></td></tr></table></figure>

<h2 id="4-层序遍历"><a href="#4-层序遍历" class="headerlink" title="4.层序遍历"></a>4.层序遍历</h2><p>层序遍历就是每一层从左到右开始遍历<br>[1,2,3,4,5,6,7]</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br></pre></td><td class="code"><pre><code class="hljs python"><span class="hljs-keyword">def</span> <span class="hljs-title function_">level_node</span>(<span class="hljs-params">node</span>):<br>    <span class="hljs-string">&quot;&quot;&quot;层序遍历</span><br><span class="hljs-string"></span><br><span class="hljs-string">    Args:</span><br><span class="hljs-string">        node (_type_): _description_</span><br><span class="hljs-string">    &quot;&quot;&quot;</span><br>    queue = [node]<br>    <span class="hljs-keyword">while</span> queue:<br>        index_node = queue.pop(<span class="hljs-number">0</span>)<br>        <span class="hljs-built_in">print</span>(index_node.value, end=<span class="hljs-string">&quot; &quot;</span>)<br>        <span class="hljs-keyword">if</span> index_node.lchild:<br>            queue.append(index_node.lchild)<br>        <span class="hljs-keyword">if</span> index_node.rchild:<br>            queue.append(index_node.rchild)<br><br></code></pre></td></tr></table></figure>

<h2 id="5-s型遍历"><a href="#5-s型遍历" class="headerlink" title="5.s型遍历"></a>5.s型遍历</h2><p>采用栈的方式，将第一层的左右孩子放到第二个栈里，然后将第二个栈的左右孩子，放到第一个栈里，依次进行。</p>
<figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br></pre></td><td class="code"><pre><code class="hljs python"><span class="hljs-keyword">def</span> <span class="hljs-title function_">s_node</span>(<span class="hljs-params">node</span>):<br>    <span class="hljs-string">&quot;&quot;&quot;层序遍历</span><br><span class="hljs-string"></span><br><span class="hljs-string">    Args:</span><br><span class="hljs-string">        node (_type_): _description_</span><br><span class="hljs-string">    &quot;&quot;&quot;</span><br>    queue = [node]<br>    queue2 = []<br>    <span class="hljs-keyword">while</span> queue:<br>        <span class="hljs-keyword">while</span> queue:<br>            index_node = queue.pop()<br>            <span class="hljs-built_in">print</span>(index_node.value, end=<span class="hljs-string">&quot; &quot;</span>)<br>            <span class="hljs-keyword">if</span> index_node.lchild:<br>                queue2.append(index_node.lchild)<br>            <span class="hljs-keyword">if</span> index_node.rchild:<br>                queue2.append(index_node.rchild)<br>        <span class="hljs-keyword">while</span> queue2:<br>            index_node2 = queue2.pop()<br>            <span class="hljs-built_in">print</span>(index_node2.value, end=<span class="hljs-string">&quot; &quot;</span>)<br>            <span class="hljs-keyword">if</span> index_node2.rchild:<br>                queue.append(index_node2.rchild)<br>            <span class="hljs-keyword">if</span> index_node2.lchild:<br>                queue.append(index_node2.lchild)<br></code></pre></td></tr></table></figure>


<h2 id="备注："><a href="#备注：" class="headerlink" title="备注："></a>备注：</h2><p><img src="/images/%E4%BA%8C%E5%8F%89%E6%A0%91/%E4%BA%8C%E5%8F%89%E6%A0%912-2.png" srcset="/img/loading.gif" lazyload alt="二叉树"><br>例如：<br>先序: [a,b,d,e,t,c,x,k,s,g]<br>后续: [d,t,e,b,k,s,x,g,c,a]<br>则有先序中 x 之前的，交上 后续中x之后的，必是x的祖先(x 为任意一个值)<br>先序x之前[a,b,d,e,t,c] &amp; <a href="%E5%90%8E%E5%BA%8Fx%E4%B9%8B%E5%90%8E">g,c,a</a> = [a,c]</p>
<ol>
<li>因为先序遍历 祖先必在 x 之前， 后序，祖先必在x之后</li>
</ol>
<h2 id="完整代码"><a href="#完整代码" class="headerlink" title="完整代码"></a>完整代码</h2><figure class="highlight python"><table><tr><td class="gutter"><pre><span class="line">1</span><br><span class="line">2</span><br><span class="line">3</span><br><span class="line">4</span><br><span class="line">5</span><br><span class="line">6</span><br><span class="line">7</span><br><span class="line">8</span><br><span class="line">9</span><br><span class="line">10</span><br><span class="line">11</span><br><span class="line">12</span><br><span class="line">13</span><br><span class="line">14</span><br><span class="line">15</span><br><span class="line">16</span><br><span class="line">17</span><br><span class="line">18</span><br><span class="line">19</span><br><span class="line">20</span><br><span class="line">21</span><br><span class="line">22</span><br><span class="line">23</span><br><span class="line">24</span><br><span class="line">25</span><br><span class="line">26</span><br><span class="line">27</span><br><span class="line">28</span><br><span class="line">29</span><br><span class="line">30</span><br><span class="line">31</span><br><span class="line">32</span><br><span class="line">33</span><br><span class="line">34</span><br><span class="line">35</span><br><span class="line">36</span><br><span class="line">37</span><br><span class="line">38</span><br><span class="line">39</span><br><span class="line">40</span><br><span class="line">41</span><br><span class="line">42</span><br><span class="line">43</span><br><span class="line">44</span><br><span class="line">45</span><br><span class="line">46</span><br><span class="line">47</span><br><span class="line">48</span><br><span class="line">49</span><br><span class="line">50</span><br><span class="line">51</span><br><span class="line">52</span><br><span class="line">53</span><br><span class="line">54</span><br><span class="line">55</span><br><span class="line">56</span><br><span class="line">57</span><br><span class="line">58</span><br><span class="line">59</span><br><span class="line">60</span><br><span class="line">61</span><br><span class="line">62</span><br><span class="line">63</span><br><span class="line">64</span><br><span class="line">65</span><br><span class="line">66</span><br><span class="line">67</span><br><span class="line">68</span><br><span class="line">69</span><br><span class="line">70</span><br><span class="line">71</span><br><span class="line">72</span><br><span class="line">73</span><br><span class="line">74</span><br><span class="line">75</span><br><span class="line">76</span><br><span class="line">77</span><br><span class="line">78</span><br><span class="line">79</span><br><span class="line">80</span><br><span class="line">81</span><br><span class="line">82</span><br><span class="line">83</span><br><span class="line">84</span><br><span class="line">85</span><br><span class="line">86</span><br><span class="line">87</span><br><span class="line">88</span><br><span class="line">89</span><br><span class="line">90</span><br><span class="line">91</span><br><span class="line">92</span><br><span class="line">93</span><br><span class="line">94</span><br><span class="line">95</span><br><span class="line">96</span><br><span class="line">97</span><br><span class="line">98</span><br><span class="line">99</span><br><span class="line">100</span><br><span class="line">101</span><br><span class="line">102</span><br><span class="line">103</span><br><span class="line">104</span><br><span class="line">105</span><br><span class="line">106</span><br><span class="line">107</span><br><span class="line">108</span><br><span class="line">109</span><br><span class="line">110</span><br><span class="line">111</span><br><span class="line">112</span><br><span class="line">113</span><br><span class="line">114</span><br><span class="line">115</span><br><span class="line">116</span><br><span class="line">117</span><br><span class="line">118</span><br><span class="line">119</span><br><span class="line">120</span><br><span class="line">121</span><br><span class="line">122</span><br><span class="line">123</span><br><span class="line">124</span><br><span class="line">125</span><br><span class="line">126</span><br><span class="line">127</span><br><span class="line">128</span><br><span class="line">129</span><br><span class="line">130</span><br><span class="line">131</span><br><span class="line">132</span><br><span class="line">133</span><br><span class="line">134</span><br><span class="line">135</span><br><span class="line">136</span><br><span class="line">137</span><br><span class="line">138</span><br><span class="line">139</span><br><span class="line">140</span><br><span class="line">141</span><br><span class="line">142</span><br><span class="line">143</span><br><span class="line">144</span><br><span class="line">145</span><br><span class="line">146</span><br><span class="line">147</span><br><span class="line">148</span><br><span class="line">149</span><br><span class="line">150</span><br><span class="line">151</span><br><span class="line">152</span><br><span class="line">153</span><br><span class="line">154</span><br><span class="line">155</span><br><span class="line">156</span><br><span class="line">157</span><br><span class="line">158</span><br><span class="line">159</span><br><span class="line">160</span><br><span class="line">161</span><br><span class="line">162</span><br><span class="line">163</span><br><span class="line">164</span><br><span class="line">165</span><br><span class="line">166</span><br><span class="line">167</span><br><span class="line">168</span><br><span class="line">169</span><br><span class="line">170</span><br><span class="line">171</span><br><span class="line">172</span><br><span class="line">173</span><br><span class="line">174</span><br></pre></td><td class="code"><pre><code class="hljs python"><span class="hljs-keyword">class</span> <span class="hljs-title class_">Node</span>:<br>    <span class="hljs-keyword">def</span> <span class="hljs-title function_">__init__</span>(<span class="hljs-params">self, value</span>) -&gt; <span class="hljs-literal">None</span>:<br>        self.value = value<br>        self.lchild = <span class="hljs-literal">None</span> <span class="hljs-comment"># 左孩子</span><br>        self.rchild = <span class="hljs-literal">None</span> <span class="hljs-comment"># 右孩子</span><br><br><span class="hljs-keyword">class</span> <span class="hljs-title class_">Tree</span>:<br>    <span class="hljs-keyword">def</span> <span class="hljs-title function_">__init__</span>(<span class="hljs-params">self</span>) -&gt; <span class="hljs-literal">None</span>:<br>        self.root = <span class="hljs-literal">None</span> <span class="hljs-comment"># 根节点</span><br><br>    <span class="hljs-keyword">def</span> <span class="hljs-title function_">add</span>(<span class="hljs-params">self, value</span>):<br>        <span class="hljs-comment"># 创建节点</span><br>        node = Node(value=value)<br>        <span class="hljs-comment"># 没有根节点这个就是根节点</span><br>        <span class="hljs-keyword">if</span> <span class="hljs-keyword">not</span> self.root:<br>            self.root = node<br>            <span class="hljs-keyword">return</span><br>        queue = [self.root]<br>        <span class="hljs-keyword">while</span> queue:<br>            index = queue.pop(<span class="hljs-number">0</span>)<br>            <span class="hljs-keyword">if</span> index.lchild:<br>                queue.append(index.lchild)<br>            <span class="hljs-keyword">else</span>:<br>                index.lchild = node<br>                <span class="hljs-keyword">return</span><br>            <br>            <span class="hljs-keyword">if</span> index.rchild:<br>                queue.append(index.rchild)<br>            <span class="hljs-keyword">else</span>:<br>                index.rchild = node<br>                <span class="hljs-keyword">return</span><br>            <br><br><span class="hljs-keyword">def</span> <span class="hljs-title function_">pre_node</span>(<span class="hljs-params">node</span>):<br>    <span class="hljs-comment"># 头序遍历</span><br>    <span class="hljs-keyword">if</span> <span class="hljs-keyword">not</span> node:<br>        <span class="hljs-keyword">return</span> <span class="hljs-string">&quot;&quot;</span><br>    <span class="hljs-built_in">print</span>(node.value, end=<span class="hljs-string">&quot; &quot;</span>)<br>    pre_node(node=node.lchild)<br>    pre_node(node=node.rchild)<br><br><span class="hljs-keyword">def</span> <span class="hljs-title function_">pre_node2</span>(<span class="hljs-params">node</span>):<br>    <span class="hljs-comment"># 头序遍历</span><br>    queue = [node]<br>    <span class="hljs-keyword">while</span> queue:<br>        index_node = queue.pop()<br>        <span class="hljs-built_in">print</span>(index_node.value, end=<span class="hljs-string">&quot; &quot;</span>)<br>        <span class="hljs-keyword">if</span> index_node.rchild:<br>            queue.append(index_node.rchild)<br>        <br>        <span class="hljs-keyword">if</span> index_node.lchild:<br>            queue.append(index_node.lchild)<br><br><br><br><span class="hljs-keyword">def</span> <span class="hljs-title function_">in_node</span>(<span class="hljs-params">node</span>):<br>    <span class="hljs-comment"># 中序遍历</span><br>    <span class="hljs-keyword">if</span> <span class="hljs-keyword">not</span> node:<br>        <span class="hljs-keyword">return</span> <span class="hljs-string">&quot;&quot;</span><br>    in_node(node=node.lchild)<br>    <span class="hljs-built_in">print</span>(node.value, end=<span class="hljs-string">&quot; &quot;</span>)<br>    in_node(node=node.rchild)<br><br><br><span class="hljs-keyword">def</span> <span class="hljs-title function_">in_node2</span>(<span class="hljs-params">node</span>):<br>    <span class="hljs-comment"># 中序遍历</span><br>    queue = []<br>    index_node = node<br>    <span class="hljs-keyword">while</span>(queue <span class="hljs-keyword">or</span> index_node):<br>        <span class="hljs-keyword">if</span> index_node:<br>            queue.append(index_node)<br>            index_node = index_node.lchild<br>        <span class="hljs-keyword">else</span>:<br>            index_node = queue.pop()<br>            <span class="hljs-built_in">print</span>(index_node.value, end=<span class="hljs-string">&quot; &quot;</span>)<br>            index_node = index_node.rchild<br><br><span class="hljs-keyword">def</span> <span class="hljs-title function_">end_node</span>(<span class="hljs-params">node</span>):<br>    <span class="hljs-comment"># 后序遍历</span><br>    <span class="hljs-keyword">if</span> <span class="hljs-keyword">not</span> node:<br>        <span class="hljs-keyword">return</span> <span class="hljs-string">&quot;&quot;</span><br>    end_node(node=node.lchild)<br>    end_node(node=node.rchild)<br>    <span class="hljs-built_in">print</span>(node.value, end=<span class="hljs-string">&quot; &quot;</span>)<br><br><span class="hljs-keyword">def</span> <span class="hljs-title function_">end_node2</span>(<span class="hljs-params">node</span>):<br>    <span class="hljs-comment"># 后序遍历</span><br>    queue = [node]<br>    queue2 = []<br>    <span class="hljs-keyword">while</span> queue:<br>        index_node = queue.pop()<br>        queue2.append(index_node)<br>        <span class="hljs-keyword">if</span> index_node.lchild:<br>            queue.append(index_node.lchild)<br>        <span class="hljs-keyword">if</span> index_node.rchild:<br>            queue.append(index_node.rchild)<br>    <br>    <span class="hljs-keyword">while</span> queue2:<br>        index_node = queue2.pop()<br>        <span class="hljs-built_in">print</span>(index_node.value, end=<span class="hljs-string">&quot; &quot;</span>)<br><br><span class="hljs-keyword">def</span> <span class="hljs-title function_">level_node</span>(<span class="hljs-params">node</span>):<br>    <span class="hljs-string">&quot;&quot;&quot;层序遍历</span><br><span class="hljs-string"></span><br><span class="hljs-string">    Args:</span><br><span class="hljs-string">        node (_type_): _description_</span><br><span class="hljs-string">    &quot;&quot;&quot;</span><br>    queue = [node]<br>    <span class="hljs-keyword">while</span> queue:<br>        index_node = queue.pop(<span class="hljs-number">0</span>)<br>        <span class="hljs-built_in">print</span>(index_node.value, end=<span class="hljs-string">&quot; &quot;</span>)<br>        <span class="hljs-keyword">if</span> index_node.lchild:<br>            queue.append(index_node.lchild)<br>        <span class="hljs-keyword">if</span> index_node.rchild:<br>            queue.append(index_node.rchild)<br><br><br><span class="hljs-keyword">def</span> <span class="hljs-title function_">s_node</span>(<span class="hljs-params">node</span>):<br>    <span class="hljs-string">&quot;&quot;&quot;层序遍历</span><br><span class="hljs-string"></span><br><span class="hljs-string">    Args:</span><br><span class="hljs-string">        node (_type_): _description_</span><br><span class="hljs-string">    &quot;&quot;&quot;</span><br>    queue = [node]<br>    queue2 = []<br>    <span class="hljs-keyword">while</span> queue:<br>        <span class="hljs-keyword">while</span> queue:<br>            index_node = queue.pop()<br>            <span class="hljs-built_in">print</span>(index_node.value, end=<span class="hljs-string">&quot; &quot;</span>)<br>            <span class="hljs-keyword">if</span> index_node.lchild:<br>                queue2.append(index_node.lchild)<br>            <span class="hljs-keyword">if</span> index_node.rchild:<br>                queue2.append(index_node.rchild)<br>        <span class="hljs-keyword">while</span> queue2:<br>            index_node2 = queue2.pop()<br>            <span class="hljs-built_in">print</span>(index_node2.value, end=<span class="hljs-string">&quot; &quot;</span>)<br>            <span class="hljs-keyword">if</span> index_node2.rchild:<br>                queue.append(index_node2.rchild)<br>            <span class="hljs-keyword">if</span> index_node2.lchild:<br>                queue.append(index_node2.lchild)<br>           <br><br><br><span class="hljs-keyword">if</span> __name__ == <span class="hljs-string">&quot;__main__&quot;</span>:<br>    tree = Tree()<br>    tree.add(<span class="hljs-number">1</span>)<br>    tree.add(<span class="hljs-number">2</span>)<br>    tree.add(<span class="hljs-number">3</span>)<br>    tree.add(<span class="hljs-number">4</span>)<br>    tree.add(<span class="hljs-number">5</span>)<br>    tree.add(<span class="hljs-number">6</span>)<br>    tree.add(<span class="hljs-number">7</span>)<br><br>    <span class="hljs-built_in">print</span>(<span class="hljs-string">&quot;先序遍历&quot;</span>)<br>    pre_node(tree.root)<br>    <span class="hljs-built_in">print</span>()<br>    pre_node2(tree.root)<br><br>    <span class="hljs-built_in">print</span>()<br>    <span class="hljs-built_in">print</span>(<span class="hljs-string">&quot;中序遍历&quot;</span>)<br>    in_node(tree.root)<br>    <span class="hljs-built_in">print</span>()<br>    in_node2(tree.root)<br><br>    <span class="hljs-built_in">print</span>()<br>    <span class="hljs-built_in">print</span>(<span class="hljs-string">&quot;后序遍历&quot;</span>)<br>    end_node(tree.root)<br>    <span class="hljs-built_in">print</span>()<br>    end_node2(tree.root)<br>    <span class="hljs-built_in">print</span>(<span class="hljs-string">&quot;\n层序遍历&quot;</span>)<br>    level_node(tree.root)<br>    <span class="hljs-built_in">print</span>(<span class="hljs-string">&quot;\ns型遍历&quot;</span>)<br>    s_node(tree.root)<br><br></code></pre></td></tr></table></figure>
                
              </div>
            
            <hr/>
            <div>
              <div class="post-metas my-3">
  
    <div class="post-meta mr-3 d-flex align-items-center">
      <i class="iconfont icon-category"></i>
      

<span class="category-chains">
  
  
    
      <span class="category-chain">
        
  <a href="/categories/%E7%AE%97%E6%B3%95%E5%AD%A6%E4%B9%A0/" class="category-chain-item">算法学习</a>
  
  

      </span>
    
  
</span>

    </div>
  
  
    <div class="post-meta">
      <i class="iconfont icon-tags"></i>
      
        <a href="/tags/%E4%BA%8C%E5%8F%89%E6%A0%91%E3%80%81%E4%BA%8C%E5%8F%89%E6%A0%91%E9%81%8D%E5%8E%86/">#二叉树、二叉树遍历</a>
      
    </div>
  
</div>


              
  

  <div class="license-box my-3">
    <div class="license-title">
      <div>2.二叉树的遍历</div>
      <div>https://sweetshance.github.io/2023/12/21/算法/二叉树/2-二叉树的遍历/</div>
    </div>
    <div class="license-meta">
      
        <div class="license-meta-item">
          <div>作者</div>
          <div>ShanCe</div>
        </div>
      
      
        <div class="license-meta-item license-meta-date">
          <div>发布于</div>
          <div>2023年12月21日</div>
        </div>
      
      
      
    </div>
    <div class="license-icon iconfont"></div>
  </div>



              
                <div class="post-prevnext my-3">
                  <article class="post-prev col-6">
                    
                    
                      <a href="/2023/12/25/python%E7%9B%B8%E5%85%B3%E7%9F%A5%E8%AF%86%E7%82%B9/python%E7%9A%84logging%E5%AE%9E%E7%8E%B0%E5%A4%9A%E8%BF%9B%E7%A8%8B%E5%AE%89%E5%85%A8/" title="python的logging实现多进程安全">
                        <i class="iconfont icon-arrowleft"></i>
                        <span class="hidden-mobile">python的logging实现多进程安全</span>
                        <span class="visible-mobile">上一篇</span>
                      </a>
                    
                  </article>
                  <article class="post-next col-6">
                    
                    
                      <a href="/2023/12/19/%E7%AE%97%E6%B3%95/%E4%BA%8C%E5%8F%89%E6%A0%91/1.%E4%BA%8C%E5%8F%89%E6%A0%91%E6%A6%82%E5%BF%B5/" title="二叉树概念">
                        <span class="hidden-mobile">二叉树概念</span>
                        <span class="visible-mobile">下一篇</span>
                        <i class="iconfont icon-arrowright"></i>
                      </a>
                    
                  </article>
                </div>
              
            </div>

            
          </article>
        </div>
      </div>
    </div>

    <div class="side-col d-none d-lg-block col-lg-2">
      
  <aside class="sidebar" style="margin-left: -1rem">
    <div id="toc">
  <p class="toc-header">
    <i class="iconfont icon-list"></i>
    <span>目录</span>
  </p>
  <div class="toc-body" id="toc-body"></div>
</div>



  </aside>


    </div>
  </div>
</div>





  



  



  



  



  







    

    
      <a id="scroll-top-button" aria-label="TOP" href="#" role="button">
        <i class="iconfont icon-arrowup" aria-hidden="true"></i>
      </a>
    

    
      <div class="modal fade" id="modalSearch" tabindex="-1" role="dialog" aria-labelledby="ModalLabel"
     aria-hidden="true">
  <div class="modal-dialog modal-dialog-scrollable modal-lg" role="document">
    <div class="modal-content">
      <div class="modal-header text-center">
        <h4 class="modal-title w-100 font-weight-bold">搜索</h4>
        <button type="button" id="local-search-close" class="close" data-dismiss="modal" aria-label="Close">
          <span aria-hidden="true">&times;</span>
        </button>
      </div>
      <div class="modal-body mx-3">
        <div class="md-form mb-5">
          <input type="text" id="local-search-input" class="form-control validate">
          <label data-error="x" data-success="v" for="local-search-input">关键词</label>
        </div>
        <div class="list-group" id="local-search-result"></div>
      </div>
    </div>
  </div>
</div>

    

    
  </main>

  <footer>
    <div class="footer-inner">
  
    <div class="footer-content">
       <a href="http://82.157.172.231/" target="_blank" rel="nofollow noopener"><span>无聊</span></a> <i class="iconfont icon-love"></i> <a href="https://github.com/fluid-dev/hexo-theme-fluid" target="_blank" rel="nofollow noopener"><span>ShanCe</span></a> 
    </div>
  
  
    <div class="statistics">
  
  

  
    
      <span id="busuanzi_container_site_pv" style="display: none">
        总访问量 
        <span id="busuanzi_value_site_pv"></span>
         次
      </span>
    
    
      <span id="busuanzi_container_site_uv" style="display: none">
        总访客数 
        <span id="busuanzi_value_site_uv"></span>
         人
      </span>
    
    
  
</div>

  
  
  
</div>

  </footer>

  <!-- Scripts -->
  
  <script  src="https://lib.baomitu.com/nprogress/0.2.0/nprogress.min.js" ></script>
  <link  rel="stylesheet" href="https://lib.baomitu.com/nprogress/0.2.0/nprogress.min.css" />

  <script>
    NProgress.configure({"showSpinner":false,"trickleSpeed":100})
    NProgress.start()
    window.addEventListener('load', function() {
      NProgress.done();
    })
  </script>


<script  src="https://lib.baomitu.com/jquery/3.6.0/jquery.min.js" ></script>
<script  src="https://lib.baomitu.com/twitter-bootstrap/4.6.1/js/bootstrap.min.js" ></script>
<script  src="/js/events.js" ></script>
<script  src="/js/plugins.js" ></script>


  <script  src="https://lib.baomitu.com/typed.js/2.0.12/typed.min.js" ></script>
  <script>
    (function (window, document) {
      var typing = Fluid.plugins.typing;
      var subtitle = document.getElementById('subtitle');
      if (!subtitle || !typing) {
        return;
      }
      var text = subtitle.getAttribute('data-typed-text');
      
        typing(text);
      
    })(window, document);
  </script>




  
    <script  src="/js/img-lazyload.js" ></script>
  




  
<script>
  Fluid.utils.createScript('https://lib.baomitu.com/tocbot/4.18.2/tocbot.min.js', function() {
    var toc = jQuery('#toc');
    if (toc.length === 0 || !window.tocbot) { return; }
    var boardCtn = jQuery('#board-ctn');
    var boardTop = boardCtn.offset().top;

    window.tocbot.init(Object.assign({
      tocSelector     : '#toc-body',
      contentSelector : '.markdown-body',
      linkClass       : 'tocbot-link',
      activeLinkClass : 'tocbot-active-link',
      listClass       : 'tocbot-list',
      isCollapsedClass: 'tocbot-is-collapsed',
      collapsibleClass: 'tocbot-is-collapsible',
      scrollSmooth    : true,
      includeTitleTags: true,
      headingsOffset  : -boardTop,
    }, CONFIG.toc));
    if (toc.find('.toc-list-item').length > 0) {
      toc.css('visibility', 'visible');
    }

    Fluid.events.registerRefreshCallback(function() {
      if ('tocbot' in window) {
        tocbot.refresh();
        var toc = jQuery('#toc');
        if (toc.length === 0 || !tocbot) {
          return;
        }
        if (toc.find('.toc-list-item').length > 0) {
          toc.css('visibility', 'visible');
        }
      }
    });
  });
</script>


  <script src=https://lib.baomitu.com/clipboard.js/2.0.11/clipboard.min.js></script>

  <script>Fluid.plugins.codeWidget();</script>


  
<script>
  Fluid.utils.createScript('https://lib.baomitu.com/anchor-js/4.3.1/anchor.min.js', function() {
    window.anchors.options = {
      placement: CONFIG.anchorjs.placement,
      visible  : CONFIG.anchorjs.visible
    };
    if (CONFIG.anchorjs.icon) {
      window.anchors.options.icon = CONFIG.anchorjs.icon;
    }
    var el = (CONFIG.anchorjs.element || 'h1,h2,h3,h4,h5,h6').split(',');
    var res = [];
    for (var item of el) {
      res.push('.markdown-body > ' + item.trim());
    }
    if (CONFIG.anchorjs.placement === 'left') {
      window.anchors.options.class = 'anchorjs-link-left';
    }
    window.anchors.add(res.join(', '));

    Fluid.events.registerRefreshCallback(function() {
      if ('anchors' in window) {
        anchors.removeAll();
        var el = (CONFIG.anchorjs.element || 'h1,h2,h3,h4,h5,h6').split(',');
        var res = [];
        for (var item of el) {
          res.push('.markdown-body > ' + item.trim());
        }
        if (CONFIG.anchorjs.placement === 'left') {
          anchors.options.class = 'anchorjs-link-left';
        }
        anchors.add(res.join(', '));
      }
    });
  });
</script>


  
<script>
  Fluid.utils.createScript('https://lib.baomitu.com/fancybox/3.5.7/jquery.fancybox.min.js', function() {
    Fluid.plugins.fancyBox();
  });
</script>


  <script>Fluid.plugins.imageCaption();</script>

  <script  src="/js/local-search.js" ></script>

  <script defer src="https://busuanzi.ibruce.info/busuanzi/2.3/busuanzi.pure.mini.js" ></script>





<!-- 主题的启动项，将它保持在最底部 -->
<!-- the boot of the theme, keep it at the bottom -->
<script  src="/js/boot.js" ></script>


  

  <noscript>
    <div class="noscript-warning">博客在允许 JavaScript 运行的环境下浏览效果更佳</div>
  </noscript>
</body>
</html>
